Some computational tools for estimating the parameters of algebraic geometry codes
نویسندگان
چکیده
We survey some recent advances in computational tools for determining estimates of the parameters of algebraic geometry codes. We show how the Weierstrass semigroup and its minimal generating set may be used to find the pure gap set as well as floors and ceilings of certain divisors. The code parameter estimates obtained are at least as good as the bounds given by Goppa and in many cases are an improvement.
منابع مشابه
Understanding Algebraic-Geometric Codes
Error-correcting codes derived from curves in an algebraic geometry are called Algebraic-Geometry Codes. The past couple of decades has seen extraordinary developments in the application of the ideas of algebraic geometry to the construction of codes and their decoding algorithms. This was initiated by the work of Goppa as generalizations of Bose-Chaudhuri-Hocquenghem (BCH), Reed-Solomon (RS), ...
متن کاملGeneric Programming Approach in the Implementation of Error-Correcting Codes From Algebraic Geometry
We describe design decisions adopted in our software implementation of decoder for a class of algebraic geometry codes. The decisions develop methodology of generic programming and show some metaprogramming techniques which are valuable when solving similar problems from the field of error-correcting codes or more generally computational algebraic geometry. We also emphasize features of C++11 w...
متن کاملParameterized codes over some embedded sets and their applications to complete graphs ∗ Manuel
Let K be a finite field, let X ⊂ Pm−1 and X ′ ⊂ Pr−1, with r < m, be two algebraic toric sets parameterized by some monomials in such a way that X ′ is embedded in X. We describe the relations among the main parameters of the corresponding parameterized linear codes of order d associated to X and X ′ by using some tools from commutative algebra and algebraic geometry. We also find the regularit...
متن کاملOne-point Goppa Codes on Some Genus 3 Curves with Applications in Quantum Error-Correcting Codes
We investigate one-point algebraic geometric codes CL(D, G) associated to maximal curves recently characterized by Tafazolian and Torres given by the affine equation yl = f(x), where f(x) is a separable polynomial of degree r relatively prime to l. We mainly focus on the curve y4 = x3 +x and Picard curves given by the equations y3 = x4-x and y3 = x4 -1. As a result, we obtain exact value of min...
متن کاملEfficiently repairing algebraic geometry codes
Minimum storage regenerating codes have minimum storage of data in each node and therefore are maximal distance separable (MDS for short) codes. Thus, the number of nodes is upper bounded by 2, where b is the bits of data stored in each node. From both theoretical and practical points of view (see the details in Section 1), it is natural to consider regenerating codes that nearly have minimum s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004